Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
نویسندگان
چکیده
منابع مشابه
Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree
Let F be a family of graphs and let d be large enough. For every d-regular graph G, we study the existence of a spanning F -free subgraph of G with large minimum degree. This problem is wellunderstood if F does not contain bipartite graphs. Here we provide asymptotically tight results for many families of bipartite graphs such as cycles or complete bipartite graphs. To prove these results, we s...
متن کاملRegular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree
Let G be a simple balanced bipartite graph on 2n vertices, δ = δ(G)/n, and ρ0 = δ+ √ 2δ−1 2 . If δ ≥ 1/2 then G has a ⌊ρ0n⌋-regular spanning subgraph. The statement is nearly tight.
متن کاملEnumeration of Spanning Subgraphs with Degree Constraints
For a finite undirected multigraph G = (V, E) and functions f, g : V → N, let N f (G, j) denote the number of (f, g)– factors of G with exactly j edges. The Heilmann-Lieb Theorem implies that ∑ j N 1 0 (G, j)t is a polynomial with only real (negative) zeros, and hence that the sequence N 0 (G, j) is strictly logarithmically concave. Separate generalizations of this theorem were obtained by Ruel...
متن کاملMinimum Face-Spanning Subgraphs of Plane Graphs
A plane graph is a planar graph with a fixed embedding. Let G = (V,E) be an edge weighted connected plane graph, where V and E are the set of vertices and edges, respectively. Let F be the set of faces of G. For each edge e ∈ E, let w(e) ≥ 0 be the weight of the edge e of G. A face-spanning subgraph of G is a connected subgraph H induced by a set of edges S ⊆ E such that the vertex set of H con...
متن کاملH-Free Graphs of Large Minimum Degree
We prove the following extension of an old result of Andrásfai, Erdős and Sós. For every fixed graph H with chromatic number r+1 ≥ 3, and for every fixed > 0, there are n0 = n0(H, ) and ρ = ρ(H) > 0, such that the following holds. Let G be an H-free graph on n > n0 vertices with minimum degree at least ( 1 − 1 r−1/3 + ) n. Then one can delete at most n2−ρ edges to make G r-colorable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2016
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548316000328